Termination w.r.t. Q proof of TRS/D3311.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

D(t) → 1
D(constant) → 0
D(+(x, y)) → +(D(x), D(y))
D(*(x, y)) → +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) → -(D(x), D(y))
D(minus(x)) → minus(D(x))
D(div(x, y)) → -(div(D(x), y), div(*(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → +(*(*(y, pow(x, -(y, 1))), D(x)), *(*(pow(x, y), ln(x)), D(y)))

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

D(t) → 1
D(constant) → 0
D(+(x, y)) → +(D(x), D(y))
D(*(x, y)) → +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) → -(D(x), D(y))
D(minus(x)) → minus(D(x))
D(div(x, y)) → -(div(D(x), y), div(*(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → +(*(*(y, pow(x, -(y, 1))), D(x)), *(*(pow(x, y), ln(x)), D(y)))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

D(t) → 1
D(constant) → 0
D(+(x, y)) → +(D(x), D(y))
D(*(x, y)) → +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) → -(D(x), D(y))
D(minus(x)) → minus(D(x))
D(div(x, y)) → -(div(D(x), y), div(*(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → +(*(*(y, pow(x, -(y, 1))), D(x)), *(*(pow(x, y), ln(x)), D(y)))

The set Q consists of the following terms:

D(t)
D(constant)
D(+(x0, x1))
D(*(x0, x1))
D(-(x0, x1))
D(minus(x0))
D(div(x0, x1))
D(ln(x0))
D(pow(x0, x1))

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

D¹(*(x, y)) → D¹(x)
D¹(minus(x)) → D¹(x)
D¹(*(x, y)) → D¹(y)
D¹(+(x, y)) → D¹(x)
D¹(+(x, y)) → D¹(y)
D¹(pow(x, y)) → D¹(y)
D¹(pow(x, y)) → D¹(x)
D¹(ln(x)) → D¹(x)
D¹(div(x, y)) → D¹(x)
D¹(-(x, y)) → D¹(y)
D¹(-(x, y)) → D¹(x)
D¹(div(x, y)) → D¹(y)

The TRS R consists of the following rules:

D(t) → 1
D(constant) → 0
D(+(x, y)) → +(D(x), D(y))
D(*(x, y)) → +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) → -(D(x), D(y))
D(minus(x)) → minus(D(x))
D(div(x, y)) → -(div(D(x), y), div(*(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → +(*(*(y, pow(x, -(y, 1))), D(x)), *(*(pow(x, y), ln(x)), D(y)))

The set Q consists of the following terms:

D(t)
D(constant)
D(+(x0, x1))
D(*(x0, x1))
D(-(x0, x1))
D(minus(x0))
D(div(x0, x1))
D(ln(x0))
D(pow(x0, x1))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

D¹(*(x, y)) → D¹(x)
D¹(minus(x)) → D¹(x)
D¹(*(x, y)) → D¹(y)
D¹(+(x, y)) → D¹(x)
D¹(+(x, y)) → D¹(y)
D¹(pow(x, y)) → D¹(y)
D¹(pow(x, y)) → D¹(x)
D¹(ln(x)) → D¹(x)
D¹(div(x, y)) → D¹(x)
D¹(-(x, y)) → D¹(y)
D¹(-(x, y)) → D¹(x)
D¹(div(x, y)) → D¹(y)

The TRS R consists of the following rules:

D(t) → 1
D(constant) → 0
D(+(x, y)) → +(D(x), D(y))
D(*(x, y)) → +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) → -(D(x), D(y))
D(minus(x)) → minus(D(x))
D(div(x, y)) → -(div(D(x), y), div(*(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → +(*(*(y, pow(x, -(y, 1))), D(x)), *(*(pow(x, y), ln(x)), D(y)))

The set Q consists of the following terms:

D(t)
D(constant)
D(+(x0, x1))
D(*(x0, x1))
D(-(x0, x1))
D(minus(x0))
D(div(x0, x1))
D(ln(x0))
D(pow(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

D¹(*(x, y)) → D¹(x)
D¹(*(x, y)) → D¹(y)
D¹(+(x, y)) → D¹(x)
D¹(+(x, y)) → D¹(y)
D¹(pow(x, y)) → D¹(y)
D¹(pow(x, y)) → D¹(x)
D¹(div(x, y)) → D¹(x)
D¹(-(x, y)) → D¹(y)
D¹(-(x, y)) → D¹(x)
D¹(div(x, y)) → D¹(y)

The remaining pairs can at least be oriented weakly.

D¹(minus(x)) → D¹(x)
D¹(ln(x)) → D¹(x)

Used ordering: Combined order from the following AFS and order.
D¹(x1) = D¹(x1)
*(x1, x2) = *(x1, x2)
minus(x1) = x1
+(x1, x2) = +(x1, x2)
pow(x1, x2) = pow(x1, x2)
ln(x1) = x1
div(x1, x2) = div(x1, x2)
-(x1, x2) = -(x1, x2)

Recursive path order with status [2].
Precedence:

*₂ > D^1₁
+₂ > D^1₁

Status:

+₂: multiset
D^1₁: multiset
-₂: multiset
div₂: multiset
pow₂: multiset
*₂: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

D¹(minus(x)) → D¹(x)
D¹(ln(x)) → D¹(x)

The TRS R consists of the following rules:

D(t) → 1
D(constant) → 0
D(+(x, y)) → +(D(x), D(y))
D(*(x, y)) → +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) → -(D(x), D(y))
D(minus(x)) → minus(D(x))
D(div(x, y)) → -(div(D(x), y), div(*(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → +(*(*(y, pow(x, -(y, 1))), D(x)), *(*(pow(x, y), ln(x)), D(y)))

The set Q consists of the following terms:

D(t)
D(constant)
D(+(x0, x1))
D(*(x0, x1))
D(-(x0, x1))
D(minus(x0))
D(div(x0, x1))
D(ln(x0))
D(pow(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

D¹(minus(x)) → D¹(x)

The remaining pairs can at least be oriented weakly.

D¹(ln(x)) → D¹(x)

Used ordering: Combined order from the following AFS and order.
D¹(x1) = D¹(x1)
minus(x1) = minus(x1)
ln(x1) = x1

Recursive path order with status [2].
Precedence:

trivial

Status:

minus₁: multiset
D^1₁: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

D¹(ln(x)) → D¹(x)

The TRS R consists of the following rules:

D(t) → 1
D(constant) → 0
D(+(x, y)) → +(D(x), D(y))
D(*(x, y)) → +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) → -(D(x), D(y))
D(minus(x)) → minus(D(x))
D(div(x, y)) → -(div(D(x), y), div(*(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → +(*(*(y, pow(x, -(y, 1))), D(x)), *(*(pow(x, y), ln(x)), D(y)))

The set Q consists of the following terms:

D(t)
D(constant)
D(+(x0, x1))
D(*(x0, x1))
D(-(x0, x1))
D(minus(x0))
D(div(x0, x1))
D(ln(x0))
D(pow(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

D¹(ln(x)) → D¹(x)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
D¹(x1) = D¹(x1)
ln(x1) = ln(x1)

Recursive path order with status [2].
Precedence:

ln₁ > D^1₁

Status:

D^1₁: multiset
ln₁: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ QDPOrderProof

                    ↳ QDP

                      ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

D(t) → 1
D(constant) → 0
D(+(x, y)) → +(D(x), D(y))
D(*(x, y)) → +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) → -(D(x), D(y))
D(minus(x)) → minus(D(x))
D(div(x, y)) → -(div(D(x), y), div(*(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → +(*(*(y, pow(x, -(y, 1))), D(x)), *(*(pow(x, y), ln(x)), D(y)))

The set Q consists of the following terms:

D(t)
D(constant)
D(+(x0, x1))
D(*(x0, x1))
D(-(x0, x1))
D(minus(x0))
D(div(x0, x1))
D(ln(x0))
D(pow(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.